Minimizing total flow time and total completion time with immediate dispatchingAVRAHAMI, Nir; AZAR, Yossi.Algorithmica. 2007, Vol 47, Num 3, pp 253-268, issn 0178-4617, 16 p.Conference Paper

Combinatorial algorithms for the unsplittable flow problemAZAR, Yossi; REGEV, Oded.Algorithmica. 2006, Vol 44, Num 1, pp 49-66, issn 0178-4617, 18 p.Article

The European Symposium on Algorithms (ESA 2006)AZAR, Yossi; ERLEBACH, Thomas.Algorithmica. 2009, Vol 53, Num 4, issn 0178-4617, 166 p.Conference Proceedings

On-line load balancing of temporary tasks on identical machinesAZAR, Yossi; EPSTEIN, Leah.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 2, pp 347-352, issn 0895-4801, 6 p.Article

Packet routing and information gathering in lines, rings and treesAZAR, Yossi; ZACHUT, Rafi.Lecture notes in computer science. 2005, pp 484-495, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Algorithms (ESA 2006)Azar, Yossi; Erlebach, Thomas.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38875-3, 1Vol, XVIII-843 p, isbn 3-540-38875-3Conference Proceedings

All-norm approximation for scheduling on identical machinesAZAR, Yossi; TAUB, Shai.Lecture notes in computer science. 2004, pp 298-310, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

On-line restricted assignment of temporary tasks with unknown durationsARMON, Amitai; AZAR, Yossi; EPSTEIN, Leah et al.Information processing letters. 2003, Vol 85, Num 2, pp 67-72, issn 0020-0190, 6 p.Article

On-line scheduling with precedence constraintsAZAR, Yossi; EPSTEIN, Leah.Discrete applied mathematics. 2002, Vol 119, Num 1-2, pp 169-180, issn 0166-218XArticle

Approximation in preemptive stochastic online schedulingMEGOW, Nicole; VREDEVELD, Tjark.Lecture notes in computer science. 2006, pp 516-527, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Engineering highway hierarchiesSANDERS, Peter; SCHULTES, Dominik.Lecture notes in computer science. 2006, pp 804-816, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 13 p.Conference Paper

On the complexity of the multiplication method for monotone CNF/DNF dualizationELBASSIONI, Khaled M.Lecture notes in computer science. 2006, pp 340-351, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Hierarchical Sampling from Sketches: Estimating Functions over Data StreamsGANGULY, Sumit; BHUVANAGIRI, Lakshminath.Algorithmica. 2009, Vol 53, Num 4, pp 549-582, issn 0178-4617, 34 p.Conference Paper

Single Machine Precedence Constrained Scheduling Is a Vertex Cover ProblemAMBÜHL, Christoph; MASTROLILLI, Monaldo.Algorithmica. 2009, Vol 53, Num 4, pp 488-503, issn 0178-4617, 16 p.Conference Paper

Maximizing throughput in Multi-Queue switchesAZAR, Yossi; LITICHEVSKEY, Arik.Algorithmica. 2006, Vol 45, Num 1, pp 69-90, issn 0178-4617, 22 p.Conference Paper

The hardness of network design for unsplittable flow with selfish usersAZAR, Yossi; EPSTEIN, Amir.Lecture notes in computer science. 2006, pp 41-54, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

On-line generalized Steiner problemAWERBUCH, Baruch; AZAR, Yossi; BARTAL, Yair et al.Theoretical computer science. 2004, Vol 324, Num 2-3, pp 313-324, issn 0304-3975, 12 p.Article

Maximizing throughput in multi-queue switchesAZAR, Yossi; LITICHEVSKEY, Arik.Lecture notes in computer science. 2004, pp 53-64, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

Strongly polynomial algorithms for the unsplittable flow problemAZAR, Yossi; REGEV, Oded.Lecture notes in computer science. 2001, pp 15-29, issn 0302-9743, isbn 3-540-42225-0Conference Paper

A Preemptive Algorithm for Maximizing Disjoint Paths on TreesAZAR, Yossi; FEIGE, Uriel; GLASNER, Daniel et al.Algorithmica. 2010, Vol 57, Num 3, pp 517-537, issn 0178-4617, 21 p.Conference Paper

Lower and Upper Bounds on FIFO Buffer Management in QoS SwitchesENGLERT, Matthias; WESTERMANN, Matthias.Algorithmica. 2009, Vol 53, Num 4, pp 523-548, issn 0178-4617, 26 p.Conference Paper

Multiplexing packets with arbitrary deadlines in bounded buffersAZAR, Yossi; LEVY, Nir.Lecture notes in computer science. 2006, pp 5-16, issn 0302-9743, isbn 3-540-35753-X, 1Vol, 12 p.Conference Paper

Optimal node routingAZAR, Yossi; CHAIUTIN, Yoel.Lecture notes in computer science. 2006, pp 596-607, issn 0302-9743, isbn 3-540-32301-5, 1Vol, 12 p.Conference Paper

An improved algorithm for CIOQ switchesAZAR, Yossi; RICHTER, Yossi.Lecture notes in computer science. 2004, pp 65-76, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

Temporary tasks assignment resolvedARMON, Amitai; AZAR, Yossi; EPSTEIN, Leah et al.Algorithmica. 2003, Vol 36, Num 3, pp 295-314, issn 0178-4617, 20 p.Article